Cost allocation in the Chinese postman problem
نویسندگان
چکیده
منابع مشابه
The directed Chinese Postman Problem
The Chinese Postman Problem has many applications, including robot exploration, and analysing interactive system and web site usability. This paper reviews the wide range of applications of the problem and presents complete, executable code to solve it for the case of directed multigraphs. A variation called the ‘open Chinese Postman Problem’ is also introduced and solved. Although optimisation...
متن کاملOn the mixed Chinese postman problem
The mixed Chinese postman problem is a version of the well-known Chinese postman problem in which the underlying graph consists of both directed and undirected edges. We give an integer linear programming formulation for this problem and then show that the extreme points of its linear relaxation polyhedron are all half-integral. keywords: Chinese postman problem, half-integrality, graph, flow
متن کاملChinese Postman Problem on Edge-Colored Multigraphs
It is well-known that the Chinese Postman Problem on undirected and directed graphs is polynomial-time solvable. We extend this result to edge-colored multigraphs. Our result is in sharp contrast to the Chinese Postman Problem on mixed graphs, i.e., graphs with directed and undirected edges, for which the problem is NP-hard.
متن کاملParameterized complexity of k-Chinese Postman Problem
We consider the following problem called the k-Chinese Postman Problem (k-CPP): given a connected edge-weighted graph G and integers p and k, decide whether there are at least k closed walks such that every edge of G is contained in at least one of them and the total weight of the edges in the walks is at most p? The problem k-CPP is NP-complete, and van Bevern et al. (to appear) and Sorge (201...
متن کاملThe Chinese Postman Problem in Regular Graphs of Odd Degree
The Chinese Postman Problem in a graph is the problem of finding a shortest closed walk traversing all the edges. In a (2r + 1)-regular graph, the problem is equivalent to finding a smallest spanning subgraph in which all vertices have odd degree. We establish a sharp upper bound for the solution in 3-regular graphs, characterize when equality holds, and conjecture the answer for general r.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 1999
ISSN: 0377-2217
DOI: 10.1016/s0377-2217(98)00310-5